Bounded arithmetic for NC, ALogTIME, L and NL
نویسندگان
چکیده
منابع مشابه
On theories of bounded arithmetic for NC
We develop an arithmetical theory VNC ∗ and its variant VNC 1 ∗, corresponding to “slightly nonuniform” NC . Our theories sit betweenVNC 1 and VL, and allow evaluation of log-depth bounded fan-in circuits under limited conditions. Propositional translations of Σ0 (LVNC1∗)-formulas provable inVNC 1 ∗ admit L-uniform polynomial-size Frege proofs.
متن کاملCuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملNP is not AL and P is not NC is not NL is not L
1. Overview This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend relation that could divide each complexity classes. 2. The condition to emulate the TM by using UTM We will begin by considering the important nature ...
متن کاملDeterministic and Randomized Bounded Truth - tableReductions of P , NL , and L to Sparse
We prove that there is no sparse hard set for P under logspace computable bounded truthtable reductions unless P = L. In case of reductions computable in NC1, the collapse goes down to P = NC1. We parameterize this result and obtain a generic theorem allowing to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields th...
متن کاملDeterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC, the collapse goes down to P=NC. We parameterize this result and obtain a generic theorem allowing us to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1992
ISSN: 0168-0072
DOI: 10.1016/0168-0072(92)90068-b